Distributed Deadlock Detection using Fault Informing Probes
نویسندگان
چکیده
Pei-yu Li and Bruce McMillin, "Fault-tolerant Distributed Deadlock Detection/ Resolution", IEEE Transactions on parallel and distributed systems, pp 224-230, 1993. M. Tamer Ozsu and Patrick Valduriez, "Principles of Distributed Database Systems", Pearson Education, 1999. Chowdhary, A. N. , Kohler, W. H. , Stankovic, J. A. and Towsley, D. , "A modified priority based probe algorithm for distributed deadlock detection and resolution", IEEE Trans, Software Eng. , vol. SE-15, pp. 10-17, Jan. 1989. Mitchell, D. P. and Merrit, M. J. , "A distributed algorithm for deadlock detection and resolution. " Proc. 3rd ACM Symp. Principles of Distributed Computing, Vancouver, Canada. pp. 282-284, Aug 1984. Roesler, M. , Burkhard, W. A. and Cooper, K. B. , "Efficient deadlock resolution for
منابع مشابه
Fault-tolerant distributed deadlock detection/resolution
The problem of deadlock detection in a distributed system has been extensively studied in the past few years. Many algorithms on distributed deadlock detection have been proposed under the assumption that the processors and communication in the system are fault-free. However, in an unreliable distributed system, faulty processors may prevent a deadlock detection algorithm from properly detectin...
متن کاملDistributed Deadlock Detection in Mobile Agent Systems
Mobile agent systems have unique properties and characteristics and represent a new application development paradigm. Existing solutions to distributed computing problems, such as deadlock avoidance algorithms, are not suited to environments where both clients and servers move freely through the network. This paper describes a distributed deadlock solution for use in mobile agent systems. The p...
متن کاملA Dynamic Priority Based Algorithm for Distributed Deadlock Detection and Resolution
In this paper we develop a distributed algorithm, using probes stamped with dynamic priorities, for detecting deadlocks in the single resource model. The correctness of the algorithm is proven. A dynamic priority is a pair where is a process and is the counter value in when initiates a deadlock detection computation. The pair is called a detector when it is referenced in a process or a resource...
متن کاملA Wait-Free Probe Algorithm for Distributed Deadlock Detection and Resolution
Edge-chasing is the basis of many deadlock detection algorithms. This method detects a deadlock by propagating special messages called probes along dependency edges. When the initiator of a probe receives the probe back, it knows the existence of a deadlock. Once a deadlock is detected, a special message called token is sent to clean up those probes in the deadlock cycle which, if not removed, ...
متن کاملPerformance Improvement and Deadlock Prevention for a Distributed Fault Diagnosis Algorithm
This research presents an overview to the issue of fault diagnosis in distributed systems and an evaluation study to some of the algorithms proposed in literature for performing distributed fault diagnosis. One algorithm was chosen and adopted for implementation in a simulator for investigation. A strategy for improving the performance of this algorithm and preventing deadlock was proposed in t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012